PERFORMANCE OF NON-COOPERATIVE ROUTING OVER PARALLEL NON-OBSERVABLE QUEUES
نویسندگان
چکیده
منابع مشابه
The price of forgetting in parallel and non-observable queues
We consider a broker-based network of non-observable parallel queues and analyze the minimum expected response time and the optimal routing policy when the broker has the memory of its previous routing decisions. We provide lower bounds on the minimum response time by means of convex programming that are tight, as follows by a numerical comparison with a proposed routing scheme. The Price of Fo...
متن کاملOn the Price of Anarchy and the Optimal Routing of Parallel non-Observable Queues
We consider a network of parallel, non-observable queues and analyze the price of anarchy , an index measuring the worst-case performance loss of a decentralized system with respect to its centralized counterpart. Our analysis is undertaken from the new point of view where the router has the memory of previous dispatching choices, which signi cantly complicates the nature of the problem. In the...
متن کاملControl of parallel non-observable queues: asymptotic equivalence and optimality of periodic policies
We consider a queueing system composed of a dispatcher that routes deterministically jobs to a set of non-observable queues working in parallel. In this setting, the fundamental problem is which policy should the dispatcher implement to minimize the stationary mean waiting time of the incoming jobs. We present a structural property that holds in the classic scaling of the system where the netwo...
متن کاملUsing Inter-Arrival Times For Scheduling In Non-Observable Queues
In online dispatching systems, when there is no opportunity to observe the state of the systems’ components, one may implement “blind” scheduling policies i.e. those which use incomplete/indirect observations of the system state or do not use any information at all. Here we deal with the well-known problem of scheduling in several non-observable parallel single server queues with single Poisson...
متن کاملRouting to parallel homogeneous queues
We give an overview of results on routing to parallel homogeneous queues, some of which were up to now unavailable in the open literature.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Probability in the Engineering and Informational Sciences
سال: 2016
ISSN: 0269-9648,1469-8951
DOI: 10.1017/s0269964816000097